Simple and Efficient Group Key Distribution Protocol using Matrices

Group Key Distribution (GKD) protocols are designed to distribute a group key several users for establishing secure communication over public network. The central trusted authority, called the distribution center (KDC) is in charge of distributing keys. For securing communication, all share common secret advance with KDC. In this paper, we propose and efficient Authenticated (GAKD) protocol based on simple idea encryption matrix rings. protocol, each user registers private KDC, while other information can be transferred publicly. scheme also supports authentication keys without assuming computational hard problems such as Integer Factorization Problem (IFP).The analysis our GAKD shows that proposed resistant reply, passive impersonation attacks. Our construction leads secure, cost computation- effective protocol.